NP - Completeness : Clique , Vertex Cover , and Dominating Set Thursday
نویسنده
چکیده
Vertex Cover (VC): A vertex cover in an undirected graph G = (V,E) is a subset of vertices V ′ ⊆ V such that every edge in G has at least one endpoint in V ′. The vertex cover problem (VC) is: given an undirected graph G and an integer k, does G have a vertex cover of size k? Dominating Set (DS): A dominating set in a graph G = (V,E) is a subset of vertices V ′ such that every vertex in the graph is either in V ′ or is adjacent to some vertex in V ′. The dominating set problem (DS) is: given a graph G = (V,E) and an integer k, does G have a dominating set of size k?
منابع مشابه
The Complexity of Planar Counting Problems
We prove the #P-hardness of the counting problems associated with various satisfiability, graph, and combinatorial problems, when restricted to planar instances. These problems include 3Sat, 1-3Sat, 1-Ex3Sat, Minimum Vertex Cover, Minimum Dominating Set, Minimum Feedback Vertex Set, X3C, Partition Into Triangles, and Clique Cover. We also prove the NP-completeness of the Ambiguous Satisfiabilit...
متن کاملCMSC 451 : Lecture 21 Clique , Vertex Cover , and Dominating Set Thursday , Nov 30 , 2017
Vertex Cover (VC): A vertex cover in an undirected graph G = (V,E) is a subset of vertices V ′ ⊆ V such that every edge in G has at least one endpoint in V ′. The vertex cover problem (VC) is: given an undirected graph G and an integer k, does G have a vertex cover of size k? Dominating Set (DS): A dominating set in a graph G = (V,E) is a subset of vertices V ′ such that every vertex in the gra...
متن کاملOn Efficient Domination for Some Classes of H-Free Chordal Graphs
A vertex set D in a finite undirected graph G is an efficient dominating set (e.d.s. for short) of G if every vertex of G is dominated by exactly one vertex of D. The Efficient Domination (ED) problem, which asks for the existence of an e.d.s. in G, is known to be NP-complete even for very restricted graph classes such as for 2P3-free chordal graphs while it is solvable in polynomial time for P...
متن کاملCdmtcs Research Report Series Parameterized Circuit Complexity and the W
A parameterized problem hL; ki belongs to W [t] if there exists k computed from k such that hL; ki reduces to the weight-k satis ability problem for weft-t circuits. We relate the fundamental question of whether the W [t] hierarchy is proper to parameterized problems for constant-depth circuits. We de ne classes G[t] as the analogues of AC depth-t for parameterized problems, and N [t] by weight...
متن کاملComplexity and approximation ratio of semitotal domination in graphs
A set $S subseteq V(G)$ is a semitotal dominating set of a graph $G$ if it is a dominating set of $G$ andevery vertex in $S$ is within distance 2 of another vertex of $S$. Thesemitotal domination number $gamma_{t2}(G)$ is the minimumcardinality of a semitotal dominating set of $G$.We show that the semitotal domination problem isAPX-complete for bounded-degree graphs, and the semitotal dominatio...
متن کامل